In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes-or-no answer, depending on the values of some input parameters. For example, the problem `given two numbers x and y, does x evenly divide y?` is a decision problem. The answer can be either `yes` or `no`, and depends...
Found on
http://en.wikipedia.org/wiki/Decision_problem
for a class of questions in mathematics and formal logic, the problem of finding, after choosing any question of the class, an algorithm or ... [5 related articles]
Found on
http://www.britannica.com/eb/a-z/d/22
A problem in which all questions take the form ``Is something a member of a particular set?'' and all answers are either ``yes'' or ``no.''
Found on
http://www.encyclo.co.uk/local/20090
See Logic, formal, §§1, 3
Found on
https://www.encyclo.co.uk/local/21203
No exact match found.
